Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs
نویسندگان
چکیده
منابع مشابه
Lack of Hyperbolicity in Asymptotic Erdös-Renyi Sparse Random Graphs
In this work, we prove that the giant component of the Erdös–Renyi random graph G(n, c/n) for c a constant greater than 1 (sparse regime), is not Gromov δ–hyperbolic for any δ with probability tending to one as n → ∞. We present numerical evidence to show that the “fat” triangles that rule out δ–hyperbolicity are in fact abundant in these graphs. We also present numerical evidence showing that,...
متن کاملAsymptotic behaviour of the complexity of coloring sparse random graphs∗
The behaviour of a backtrack algorithm for graph coloring is well understood for large random graphs with constant edge density. However, sparse graphs, in which the edge density decreases with increasing graph size, are more common in practice. Therefore, in this paper we analyze the expected runtime of a usual backtrack search to color such random graphs, when the size of the graph tends to i...
متن کاملOn the Hyperbolicity of Random Graphs
Let G = (V,E) be a connected graph with the usual (graph) distance metric d : V ×V → N∪{0}. Introduced by Gromov, G is δ-hyperbolic if for every four vertices u, v, x, y ∈ V , the two largest values of the three sums d(u, v) + d(x, y), d(u, x) + d(v, y), d(u, y) + d(v, x) differ by at most 2δ. In this paper, we determine precisely the value of this hyperbolicity for most binomial random graphs.
متن کاملLack of Gromov-Hyperbolicity in Colored Random Networks
The geometry of complex networks has a close relationship with their structure and function. In this paper, we introduce an inhomogeneous random network G(n, {ci}, {pi}), called the colored random network, and investigate its Gromov-hyperbolicity. We show that the colored random networks are non-hyperbolic in the regime Pm i=1 c 2 i pi = c/n for c > 1, by approximation to binomial random graphs...
متن کاملBisecting sparse random graphs
Consider partitions of the vertex set of a graph G into two sets with sizes differing by at most 1: the bisection width of G is the minimum over all such partitions of the number of ‘‘cross edges’’ between the parts. We are interested in sparse random graphs Ž . G with edge probability c n. We show that, if c ln 4, then the bisection width is n n, c n with high probability; while if c ln 4, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2015
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2014.1002640